Decidability of trajectory-based equations

Decidability of Trajectory-Based Equations

We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the operations of concatenation, insertion, shuffle, quotient, sequential and scattered deletion, as well as many others. Our results are constructive in the sense that if a solution exists, it can be effectively represente...

Decidability of Trajectory-Based Equations

Decidability of Class Based Knowledge Representation Formalisms

6 N-ary Relations 77 6.1 The logic Bibliography 125 4 Preface This document is the English version of my doctoral thesis 35]. It presents the research w ork I have done, mostly at the Dipartimento di Informatica e Sistemistica, Universitt a di Roma \La Sapienza", from 1992 to the beginning of 1995, under the supervision of Maurizio Lenzerini. The thesis is concerned with logic-based knowledge r...

Decidability of order-based modal logics

Decidability of the validity problem is established for a family of many-valued modal logics, notably modal logics based on Gödel logics, where propositional connectives are evaluated locally at worlds according to the order of values in a complete sublattice of the real unit interval, and box and diamond modalities are evaluated as infima and suprema of values in (many-valued) Kripke frames. W...

OT Syntax - Decidability of Generation-based Optimization

Abstract In Optimality-Theoretic Syntax, optimization with unrestricted expressive power on the side of the OT constraints is undecidable. This paper provides a proof for the decidability of optimization based on constraints expressed with reference to local subtrees (which is in the spirit of OT theory). The proof builds on Kaplan and Wedekind’s (2000) construction showing that LFG generation ...